Reconstruction of Convex Bodies from Brightness Functions
نویسندگان
چکیده
Algorithms are given for reconstructing an approximation to an unknown convex body from finitely many values of its brightness function, the function giving the volumes of its projections onto hyperplanes. One of these algorithms constructs a convex polytope with less than a prescribed number of facets, while the others do not restrict the number of facets. Convergence of the polytopes to the body is proved under certain essential assumptions including origin symmetry of the body. Also described is an oracle-polynomialtime algorithm for reconstructing an approximation to an origin-symmetric rational convex polytope of fixed and full dimension that is only accessible via its brightness function. Some of the algorithms have been implemented, and sample reconstructions are provided.
منابع مشابه
Nakajima’s Problem for General Convex Bodies
For a convex body K ⊂ Rn, the kth projection function of K assigns to any k-dimensional linear subspace of Rn the k-volume of the orthogonal projection of K to that subspace. Let K and K0 be convex bodies in Rn, let K0 be centrally symmetric and satisfy a weak regularity assumption. Let i, j ∈ N be such that 1 ≤ i < j ≤ n − 2 with (i, j) 6= (1, n−2). Assume that K and K0 have proportional ith p...
متن کاملNakajima’s Problem: Convex Bodies of Constant Width and Constant Brightness
For a convex body K ⊂ Rn, the kth projection function of K assigns to any k-dimensional linear subspace of Rn the k-volume of the orthogonal projection of K to that subspace. Let K and K0 be convex bodies in Rn, and let K0 be centrally symmetric and satisfy a weak regularity and curvature condition (which includes all K0 with ∂K0 of class C2 with positive radii of curvature). Assume that K and ...
متن کاملPhase Retrieval for Characteristic Functions of Convex Bodies and Reconstruction from Covariograms
We propose strongly consistent algorithms for reconstructing the characteristic function 1K of an unknown convex body K in R from possibly noisy measurements of the modulus of its Fourier transform 1̂K . This represents a complete theoretical solution to the Phase Retrieval Problem for characteristic functions of convex bodies. The approach is via the closely related problem of reconstructing K ...
متن کاملConvex Bodies of Constant Width and Constant Brightness
Under the extra assumption that the boundary is of class C this was proven by S. Nakajima (= A. Matsumura) in 1926 Theorem 1 solves this problem. For convex bodies with C boundaries and positive curvature Nakajima’s result was generalized by Chakerian [?] in 1967 to “relative geometry” where the width and brightness are measured with with respect to some convex body K0 symmetric about the origi...
متن کاملShape from Multiple Cues: Integrating Local Brightness Information
In this paper, a novel approach to shape from multiple cues is further refined and applied to the task of combining contours with local brightness information. The approach, furtheron called the sculptor's principle, does not attempt to construct an 'optimum' solution but rather finds an enclosing volume that must contain the true solution. Shape from contours algorithms only provide accurate r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 29 شماره
صفحات -
تاریخ انتشار 2003